Symbolic Local Refinement of Tetrahedral Grids
نویسندگان
چکیده
منابع مشابه
A Parallel, Adaptive Refinement Scheme for Tetrahedral and Triangular Grids
A grid re nement scheme has been developed for tetrahedral and triangular grid-based calculations in message-passing environments. The element adaption scheme is based on edge bisection of elements marked for re nement by an appropriate error indicator. Hash table/linked list data structures are used to store nodal and element information. The grid along inter-processor boundaries is re ned con...
متن کاملParallel Multilevel Tetrahedral Grid Refinement
In this paper we analyze a parallel version of a multilevel red/green local refinement algorithm for tetrahedral meshes. The refinement method is similar to the approaches used in the UG-package [33] and by Bey [11, 12]. We introduce a new data distribution format that is very suitable for the parallel multilevel refinement algorithm. This format is called an admissible hierarchical decompositi...
متن کاملLocal Bisection Refinement for N-Simplicial Grids Generated by Reflection
A simple local bisection refinement algorithm for the adaptive refinement of n-simplicial grids is presented. The algorithm requires that the vertices of each simplex be ordered in a special way relative to those in neighboring simplices. It is proven that certain regular simplicial grids on [0, 1]n have this property, and the more general grids to which this method is applicable are discussed....
متن کاملVolume Decimation of Irregular Tetrahedral Grids
Rendering highly complex models can be time and space prohibitive, and decimation is an important tool in providing simplifications. A decimated model may replace the original entirely or provide level-of-detail approximations. Here we present and evaluate, quantitatively and qualitatively, methods for rapidly decimating volumetric data defined on a tetrahedral grid. Results are compared using ...
متن کاملParallel Refinement and Coarsening of Tetrahedral Meshes
This paper presents a parallel adaptation procedure (coarsening and re nement) for tetrahedral meshes in a distributed environment. Coarsening relies upon an edge collapsing tool. Re nement uses edge-based subdivision templates. Mesh optimization maintains the quality of the adapted meshes. Focus is given to the parallelization of the various components. Scalability requires repartitioning of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1994
ISSN: 0747-7171
DOI: 10.1006/jsco.1994.1029